Nested Transaction: An Efficient Facility to Enforce the Nesting and the Partial Ordering Requirements in S-Store

نویسندگان

  • Chenggang Wu
  • Stan Zdonik
  • Uĝur Çetintemel
چکیده

The goal of this thesis is to design and implement an efficient facility to enforce the nesting and the partial ordering requirements of transactions in S-Store [1], the world’s first streaming OLTP engine for real-time applications. We first compare and contrast different approaches to enforce these requirements, and conclude that nested transaction stands out both in terms of data integrity guarantees and performance. We then offer details regarding the design and implementation of nested transactions in both single-partition scenarios and distributed scenarios. Finally, we discuss several optimization techniques to further improve the performance of nested transaction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations

In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

متن کامل

Negations and aggregation operators based on a new hesitant fuzzy partial ordering

Based on a new hesitant fuzzy partial ordering proposed by Garmendia et al.~cite{GaCa:Pohfs}, in this paper a fuzzy disjunction ${D}$ on the set ${H}$ of finite and nonempty subsets of the unit interval and a t-conorm ${S}$ on the set $bar{{B}}$ of equivalence class on the set of finite bags of unit interval based on this partial ordering are introduced respectively. Then, hesitant fuzzy negati...

متن کامل

Cuckoo search via Levy flights applied to uncapacitated facility location problem

Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...

متن کامل

The impact of non-compliance with the legal requirements for disclosure of information on securities transaction

Due to the specific characteristics of securities, in securities contracts it is difficult for the investors to have the information which is necessary for entering into the contract. Accordingly, in accordance with the Securities Market Act and the relevant regulations, the issuers of securities, in the primary and secondary markets, are required to disclose material information about securiti...

متن کامل

On Closed Nesting in Distributed Transactional Memory

Distributed Software Transactional Memory (D-STM) is a recent but promising model for programming distributed systems. It aims to present programmers with a simple to use abstraction (transactions), while maintaining performance and scalability similar to distributed fine-grained locks. Any complications usually associated with such locks (i.e. distributed deadlock) are avoided. Building upon t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015